The Bounded Sequential Searching (Bss) Priority Queue in Discrete Event Simulation

In Discrete Event Simulation the whole running time is mainly determined by the type of data structure intended to manage the pending event set. The Bounded Sequential Searching (BSS) Priority Queue is a pending event set implementation proposal for which empirical evidence of good performance, under the Hold Model, is shown. The complexity of BSS associated algorithms are assessed and some implementation guidelines are given. BSS main features are commented and finally a list of open problems and current work is remarked.